CR-Prolog with Ordered Disjunction

نویسندگان

  • Marcello Balduccini
  • Veena S. Mellarkod
چکیده

We present CR-Prolog , an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also show how CR-Prolog can be used to represent preferences intended both as strict preferences (like in CR-Prolog), and as desires (like in LPOD, where ordered disjunction was initially introduced). Finally, we show how the new language can be used to represent complex knowledge and to perform fairly sophisticated reasoning tasks.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CR-Prolog2: CR-Prolog with Ordered Disjunction

We present CR-Prolog2, an extension of CR-Prolog with an improved semantics, and allowing ordered disjunction in the head of both regular rules and consistency-restoring rules. The new semantics yields intuitive conclusions in cases when CR-Prolog would give unintuitive results. The use of ordered disjunction often allows for a more concise, easier to read, representation of knowledge. We also ...

متن کامل

QPATR and Constraint Threading

QPATR is an MS-DOS Arity/PROLOG implementation of the PATR-II formalism for unification grammar. The fbnnalism has been extended to include the constraints of LFG as well as negation and disjunction, which are implemented with the disjunction and negation-as-failure of PROLOG itself. A technique of constraint threading is employed to collect negative and constraining conditions in PROLOG differ...

متن کامل

Extensible Search with Hookable Disjunction

Horn Clause Programs have a natural depth-first procedural semantics. However, for many programs this procedural semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a well-defined hook into Prolog disjunction, provides this ability. It is light-weight thanks to its library approa...

متن کامل

Towards Logic Programs with Ordered and Unordered Disjunction

Logic Programming paradigms that allow for expressing preferences have drawn a lot of research interest over the last years. Among them, the principle of ordered disjunction was developed to express totally ordered preferences for alternatives in rule heads. In this paper we introduce an extension of this approach called Disjunctive Logic Programs with Ordered Disjunction (DLPOD) that combines ...

متن کامل

Tor: Modular search with hookable disjunction

Horn Clause Programs have a natural exhaustive depth-first procedural semantics. However, for many programs this semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a well-defined hook into Prolog disjunction, provides this ability. It is light-weight thanks to its library approa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003